Entrevista a Tidy Arquitectos: Albert Tidy V. [AT] + Ian Tidy V. [IT]

On P4-tidy graphs

We study the P4-tidy graphs, a new class defined by Rusu [30] in order to illustrate the notion of P4-domination in perfect graphs. This class strictly contains the P4-extendible graphs and the P4-lite graphs defined by Jamison & Olariu in [19] and [23] and we show that the P4-tidy graphs and P4-lite graphs are closely related. Note that the class of P4-lite graphs is a class of brittle graphs ...

Tidy Animations of Tree Algorithms

In software visualization and algorithm animation it is important that advances in system technologies are accompanied by corresponding advances in animation presentations. In this paper we describe methods for animating tree manipulation algorithms, one of the most challenging algorithm animation domains. In particular, we animate operations on pairing heap data structures which are used to im...

Deriving Tidy Drawings of Trees

The tree-drawing problem is to produce a `tidy' mapping of elements of a tree to points in the plane. In this paper, we derive an eecient algorithm for producing tidy drawings of trees. The speciication, the starting point for the derivations, consists of a collection of intuitively appealing criteria satissed by tidy drawings. The derivation shows constructively that these criteria completely ...

Tidy wr iting tool using time information

Electronic whiteboards are capable of preserving and reusing writings on blackboards (or whiteboards) at classes. This means that many more people than before can see the writings. Making these writings tidy is a desired feature. This paper describes a writing tool on the electronic whiteboards. The tool uses time information to treat strokes as two levels of chunks: the character level and the...

Tidy or Tangled: How People Perceive Landscapes